Intuitionistic three-valued logic and logic programming
نویسندگان
چکیده
منابع مشابه
Programming in Three-valued Logic
The aim of this paper is to propose a logical and algebraic theory which seems well-suited to logic programs with negatior, and deductive databases. This theory has similar properties to those of Prolog theory limited to programs with Horn clauses and tbns can be considered as sn extension of the usual theory. This parallel with logic programming without negation lies in the introduction of a t...
متن کاملLogic Programming in a Fragment of Intuitionistic Linear Logic
When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal of the form D ⊃ G from the context (set of formulas) Γ leads to an attempt to prove the goal G in the extended context Γ ∪ {D). Thus during the bottomup search for a cut-free proof contexts, represented as the left-han...
متن کاملLogic Programming in a Fragment of Intuitionistic Temporal Linear Logic
Recent development of logic programming languages based on linear logic suggests a successful direction to extend logic programming to be more expressive and more efficient. The treatment of formulasas-resources gives us not only powerful expressiveness, but also efficient access to a large set of data. However, in linear logic, whole resources are kept in one context, and there is no straight ...
متن کاملLearning Three-Valued Logic Programs
We show that the adoption of a three-valued setting for inductive concept learning is particularly useful for learning. Distinguishing between what is true, what is false and what is unknown can be useful in situations where decisions have to be taken on the basis of scarce information. In order to learn in a three-valued setting, we adopt Extended Logic Programs (ELP) under a Well-Founded Sema...
متن کاملLogic Programming in aFragment of Intuitionistic
Logic programming languages based on fragments of intuitionistic logic have recently been developed and studied by several researchers. In such languages, implications are permitted in goals and in the bodies of clauses. Attempting to prove a goal of the form D G in a context ? leads to an attempt to prove the goal G in the extended context ? fDg. While an intuition-istic notion of context has ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 1991
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita/1991250605571